Fast positioning of limited-visibility guards for the inspection of 2D workspaces
نویسندگان
چکیده
This paper presents a novel method for deciding the locations of “guards” required to visually inspect a given 2D workspace. The decided guard positions can then be used as control points in the path of a mobile robot that autonomously inspects a workspace. It is assumed that each of the guards (or the mobile robot that visits the guard positions in some order) is equipped with a panoramic camera of 360 degrees field of view. However, the camera has limited visibility, in the sense that it can observe with sufficient detail objects that are not further than a predefined visibility range. The method seeks to efficiently produce solutions that contain the smaller possible number of guards. Experimental results demonstrate that the proposed method is computationally efficient and that, although suboptimal, decides a small number of guards.
منابع مشابه
Randomized Planning for Short Inspection Paths
This paper addresses the following inspection problem: given a known workspace and a robot with vision capabilities compute a short path path for the robot such that each point on boundary of the workspace is visible from some point on the path. Autonomous inspection, such as by a flying camera, or a virtual reality architectural walkthrough, could be guided by a solution to the above inspectio...
متن کاملEfficient and Complete Coverage of 2D Environments by Connectivity Graphs for Motion Planning Algorithms
In this paper, we use an efficient art gallery-based algorithm for placing a small number of guards to inspect a 2D environment. The gallery models a 2D workspace for an autonomous robot. The proposed algorithm efficiently computes a near-optimal (small) number of guards in O(n log n) time and requires a linear storage complexity. An additional set of connection nodes are computed to form the c...
متن کاملEpileptic seizure detection based on The Limited Penetrable visibility graph algorithm and graph properties
Introduction: Epileptic seizure detection is a key step for both researchers and epilepsy specialists for epilepsy assessment due to the non-stationariness and chaos in the electroencephalogram (EEG) signals. Current research is directed toward the development of an efficient method for epilepsy or seizure detection based the limited penetrable visibility graph (LPVG) algorith...
متن کاملA Fast Algorithm for Covering Rectangular Orthogonal Polygons with a Minimum Number of r-Stars
Introduction This paper presents an algorithm for covering orthogonal polygons with minimal number of guards. This idea examines the minimum number of guards for orthogonal simple polygons (without holes) for all scenarios and can also find a rectangular area for each guards. We consider the problem of covering orthogonal polygons with a minimum number of r-stars. In each orthogonal polygon P,...
متن کاملOptimum Inapproximability Results for Finding Minimum Hidden Guard Sets in Polygons and Terrains
We study the problemMinimum Hidden Guard Set, which consists of positioning a minimum number of guards in a given polygon or terrain such that no two guards see each other and such that every point in the polygon or on the terrain is visible from at least one guard. By constructing a gap-preserving reduction from Maximum 5-Ocurrence3-Satisfiability, we show that this problem cannot be approxima...
متن کامل